Scalable Schedule Routing and Minimizing Delay in Tolerant Networks

There are many routing strategies for message delivery in Delay Tolerant Networks. Among them Multicopying routing strategies have been considered the most applicable DTNs. Epidemic routing and two-hop forwarding routing are the two best approaches of DTN. These two approaches belong to multicopying routing strategies as they allow multiple message replicas to increase message delivery delay. This is an advantage, but it might cause expense of additional buffer space and bandwidth overhead. Hence the message scheduling strategy should determine which messages should be dropped in case if buffer is full. Thus, this work deals with a new message scheduling framework for epidemic and two hop forwarding routing in DTNs, such that the decision for forwarding/dropping can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that this message scheduling framework can achieve better performance.